Linearization: Geometric, Complex, and Conditional
نویسنده
چکیده
Lie symmetry analysis provides a systematic method of obtaining exact solutions of nonlinear systems of differential equations, whether partial or ordinary. Of special interest is the procedure that Lie developed to transform scalar nonlinear second-order ordinary differential equations to linear form. Not much work was done in this direction to start with, but recently there have been various developments. Here, first the original work of Lie and the early developments on it , and then more recent developments based on geometry and complex analysis, apart from Lie’s own method of algebra namely, Lie group theory , are reviewed. It is relevant to mention that much of the work is not linearization but uses the base of linearization.
منابع مشابه
Fuzzy Modeling and Synchronization of a New Hyperchaotic Complex System with Uncertainties
In this paper, the synchronization of a new hyperchaotic complex system based on T-S fuzzy model is proposed. First, the considered hyperchaotic system is represented by T-S fuzzy model equivalently. Then, by using the parallel distributed compensation (PDC) method and by applying linear system theory and exact linearization (EL) technique, a fuzzy controller is designed to realize the synchron...
متن کاملLinearization-preserving self-adjoint and symplectic integrators
This article is concerned with geometric integrators which are linearization-preserving, i.e. numerical integrators which preserve the exact linearization at every fixed point of an arbitrary system of ODEs. For a canonical Hamiltonian system, we propose a new symplectic and self-adjoint B-series method which is also linearization-preserving. In a similar fashion, we show that it is possible to...
متن کاملImage alignment via kernelized feature learning
Machine learning is an application of artificial intelligence that is able to automatically learn and improve from experience without being explicitly programmed. The primary assumption for most of the machine learning algorithms is that the training set (source domain) and the test set (target domain) follow from the same probability distribution. However, in most of the real-world application...
متن کاملWhat can Grassmann, Hamilton and Clifford tell us about Computer Vision and Robotics
Geometric algebra is a universal mathematical language which provides very comprehensive techniques for analyzing the complex geometric situations occurring in robotics and computer vision. The application of the 4D motor algebra for the linearization of the the hand-eye calibration problem is presented. Geometric algebra and its associated linear algebra framework is a very elegant language to...
متن کاملLinearization Variance Estimators for Survey Data with Missing Responses
Taylor linearization is a popular method of variance estimation for complex statistics such as ratio and regression estimators and logistic regression coefficient estimators. It is generally applicable to any sampling design that permits unbiased variance estimation for linear estimators, and it is computationally simpler than a resampling method such as the jackknife. However, it can lead to m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Applied Mathematics
دوره 2012 شماره
صفحات -
تاریخ انتشار 2012